Combinatorial Rules for Three Bases of Polynomials

نویسنده

  • COLLEEN ROSS
چکیده

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1, x2, ....]. First, we prove a ”splitting” rule for the basis of Key polynomials [Demazure ’74], thereby establishing a new positivity theorem about them. Second, we introduce an extension of [Kohnert ’90]’s ”moves” to conjecture the first combinatorial rule for a certain deformation [Lascoux ’01] of the Key polynomials. Third, we use the same extension to conjecture a new rule for the Grothendieck polynomials [LascouxSchützenberger ’82]. In memory of Alain Lascoux, who inspired this paper one night in Osaka

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Aspects of the Cohomology and K-theory of Flag Varieties

In this talk we present some recent results related to Schubert and Grothendieck polynomials. These polynomials represent Schubert classes, which form the natural bases of the cohomology and K-theory of the complex flag variety. We present background information on several combinatorial constructions of Schubert and Grothendieck polynomials. Then we present the solution to a conjecture concerni...

متن کامل

An explicit construction of type A Demazure atoms

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Schützenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the right key...

متن کامل

Integer-Valued Polynomials: Looking for Regular Bases (a Survey)

This paper reviews recent results about the additive structure of algebras of integer-valued polynomials, and particularly, the question of the existence and the construction of regular bases. Doing this, we will be led to consider questions of combinatorial, arithmetical, algebraic, ultrametric or dynamical nature. 2010 MSC. Primary 13F20; Secondary 11S05, 11R21, 11B65

متن کامل

Degenerating Geometry to Combinatorics : Research Proposal for

A central appeal of algebraic geometry is that its functions are polynomials which can be written down as finite expressions. This makes the theory naturally combinatorial, in that polynomials are made up of a finite number of terms which interact through discrete rules. In practice, however, the operations performed on these polynomials are usually too complex for combinatorial methods to be o...

متن کامل

Spivey's Generalized Recurrence for Bell Numbers

This entry defines the Bell numbers [1] as the cardinality of set partitions for a carrier set of given size, and derives Spivey’s generalized recurrence relation for Bell numbers [2] following his elegant and intuitive combinatorial proof. As the set construction for the combinatorial proof requires construction of three intermediate structures, the main difficulty of the formalization is hand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017